W-convergence of the proximal point algorithm in complete CAT(0) metric spaces

Halpern-type proximal point algorithm in complete CAT(0) metric spaces

First, Halpern-type proximal point algorithm is introduced in complete CAT(0) metric spaces. Then, Browder convergence theorem is considered for this algorithm and also we prove that Halpern-type proximal point algorithm converges strongly to a zero of the operator.

Fixed Point Theorems in Complete Metric Spaces

THE STUDY in fixed point theory has generally developed in three main directions: generalization of conditions which ensure existence, and, if possible, uniqueness, of fixed points; investigation of the character of the sequence of iterates (T”x)~~~, where T: X + X, X a complete metric space, is the map under consideration; study of the topoligical properties of the set of fixed points, wheneve...

Common Fixed Point Theorems for Four Mappings in Complete Metric Spaces

A Ciric-type common fixed point theorem in complete b-metric spaces

In this paper, we define the concept of compatible and weakly compatible mappings in b-metric spaces and inspired by the Ciric and et. al method, we produce appropriate conditions for given the unique common fixed point for a family of the even number of self-maps with together another two self-maps in a complete b-metric spaces. Also, we generalize this common fixed point theorem for a seq...

A generalization of Kannan and Chatterjea fixed point theorems on complete $b$-metric spaces

In this paper, we give some results on the common fixed point of self-mappings defined on complete $b$-metric spaces. Our results generalize Kannan and Chatterjea fixed point theorems on complete $b$-metric spaces. In particular, we show that two self-mappings satisfying a contraction type inequality have a unique common fixed point. We also give some examples to illustrate the given results.

Convergence Theorems of Approximate Proximal Point Algorithm for Zeroes of Maximal Monotone Operators in Hilbert Spaces

In this paper, we introduce two kinds of iterative algorithms for finding zeroes of maximal monotone operators, and establish strong and weak convergence theorems of the modified proximal point algorithms. By virtue of the established theorems, we consider the problem of finding a minimizer of a convex function. Mathematics Subject Classification: Primary 47H17; Secondary 47H05, 47H10